Execution time analysis of a top-down R-tree construction algorithm
نویسندگان
چکیده
A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y.J. García, M.A. López, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS’98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163–164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Analysis on Components Complexity During Execution of Construction Projects
Development is the fundamental area in enabling India`s economy and urban and provincial structure. Development is a multi-connected structure where all variables are bury connected and multi-centered. All the three limitations time, expense and quality ought to be adjusted in an improved way, so that no segment gets influenced by dismissing those. The goal of this study is to distinguish the m...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملHierarchical Growing Neural Gas
This paper describes TreeGNG, a top-down unsupervised learning method that produces hierarchical classification schemes. TreeGNG is an extension to the Growing Neural Gas algorithm that maintains a time history of the learned topological mapping. TreeGNG is able to correct poor decisions made during the early phases of the construction of the tree, and provides the novel ability to influence th...
متن کاملOptimal Integer Alphabetic Trees in Linear Time
We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear time. We describe a hybrid algorithm that combines the bottom-up approach of the original Hu-Tucker algorithm with the top-down approach of Larmore and Przytycka’s Cartesian tree algorithms. The hybrid algorithm demonstrates th...
متن کاملAn integrated simulation-DEA approach to multi-criteria ranking of scenarios for execution of operations in a construction project
The purpose of this study is to examine different scenarios for implementing operations in the pre-construction phase of a project, based on several competing criteria with different importance levels in order to achieve a more efficient execution plan. This paper presents a new framework that integrates discrete event simulation (DES) and data envelopment analysis (DEA) to rank different scena...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 101 شماره
صفحات -
تاریخ انتشار 2007